Query Formulation from High-Level Concepts for Relational Databases

نویسندگان

  • Guogen Zhang
  • Wesley W. Chu
  • Frank Meng
  • Gladys Kong
چکیده

A new query formulation system based on a semantic graph model is presented. The graph provides a semantic model for the data in the database with userde ned relationships. The query formulator allows users to specify their requests and constraints in highlevel concepts. The query candidates are formulated based on the user input by a graph search algorithm and ranked according to a probabilistic information measure. English-like query descriptions can also be provided for users to resolve ambiguity when multiple queries are formulated from a user input. For complex queries, we introduce an incremental approach, which assists users to achieve a complex query goal by formulating a series of simple queries. A prototype system with a multimodal interface using the high-level query formulation techniques has been implemented on top of a cooperative database system (CoBase) at UCLA.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relational Databases Query Optimization using Hybrid Evolutionary Algorithm

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

متن کامل

Using Unity to Semi-Automatically Integrate Relational Schema

Unity is an architecture for integrating relational databases that performs three processes: metadata capture, semantic integration, and query formulation and execution. The foundation of the architecture is a naming methodology that allows concepts to be integrated across systems. Semantic naming of schema constructs increases automation during integration and provides users with physical and ...

متن کامل

Ontology - based Induction of High Level Classi cationRules

A tool that could be beneecial to the data mining community is one that facilitates the seamless integration of knowledge bases and databases. This kind of tool could form the foundation of a data mining system capable of nding interesting information using ontologies. In this paper, we describe a new algorithm based on the query facilities provided by such a tool, ParkaDB which is a knowledge ...

متن کامل

Ontology-based Induction of High Level Classification Rules

A tool that could be bene cial to the data mining community is one that facilitates the seamless integration of knowledge bases and databases. This kind of tool could form the foundation of a data mining system capable of nding interesting information using ontologies. In this paper, we describe a new algorithm based on the query facilities provided by such a tool, ParkaDB which is a knowledge ...

متن کامل

A Reuse Based Object-Oriented Framework Towards Flexible Formulation of Computer Queries

In database or knowledge-base systems, query formulation languages are the means offered to users for accessing data or knowledge. Queries allow selection of data under particular – either simple or complex constraints, resulting from one or several structures. However, query formulation remains obstinately difficult for large classes of users. Indeed, with the exception of approaches facilitat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999